Baler: deterministic, lossless log message clustering tool
نویسندگان
چکیده
منابع مشابه
Deterministic identification of lossless and dissipative systems
We illustrate procedures to identify a state-space representation of a passive or bounded-real system from noisefree measurements. The basic idea underlying our algorithms is to obtain a state sequence from a rank-revealing factorization of a Gramian-like matrix constructed from the data. The computation of state-space equations is then performed solving a system of linear equations, similarly ...
متن کاملPoClustering: Lossless Clustering of Dissimilarity Data
Given a set of objects V with a dissimilarity measure between pairs of objects in V , a PoCluster is a collection of sets P ⊂ powerset(V ) partially ordered by the ⊂ relation such that S ⊂ T iff the maximal dissimilarity among objects in S is less than the maximal dissimilarity among objects in T . PoClusters capture categorizations of objects that are not strictly hierarchical, such as those f...
متن کاملLossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, planning optimally is difficult because solutions map local observation histories to actions, and the number of such histories grows exponentially in the planning horizon. In this work, we identify a criterion that allows for...
متن کاملDeterministic clustering with data nets
We consider the K-clustering problem with the `2 distortion measure, also known as the problem of optimal fixed-rate vector quantizer design. We provide a deterministic approximation algorithm which works for all dimensions d and which, given a data set of size n, computes in time poly(K)(d/ε)n log log n+(d/ε) a solution of distortion at most 1+ε times optimal. The key tool is construction of a...
متن کاملModel clustering by deterministic annealing
Although training an ensemble of neural network solutions increases the amount of information obtained from a system, large ensembles may be hard to analyze. Since data clustering is a good method to summarize large bodies of data, we will show in this paper how to use clustering on instances of neural networks. We will describe an algorithm based on deterministic annealing, which is able to cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science - Research and Development
سال: 2011
ISSN: 1865-2034,1865-2042
DOI: 10.1007/s00450-011-0155-3